Characterization of c-circulant digraphs of degree two which are circulant
نویسندگان
چکیده
A c-circulant digraph G,(c, A) has Z,V as its vertex set and adjacency rules given by .X + cs + a with a E A c Z,. The c-circulant digraphs of degree two which are isomorphic to some circulant digraph are characterized, and the corresponding isomorphism is given. Moreover. a sufficient condition is obtained for a c-circulant digraph to be a Cayley digraph.
منابع مشابه
Circulant Digraphs and Monomial Ideals
It is known that there exists a Minimum Distance Diagram (MDD) for circulant digraphs of degree two (or double-loop computer networks) which is an L-shape. Its description provides the diameter and the average distance of the graph on constant time. In this paper we clarify, justify and extend these diagrams to circulant digraphs of arbitrary degree by presenting monomial ideals as a natural to...
متن کاملThe (\Delta,D) and (\Delta,N) problems for New Amsterdam and Manhattan digraphs
We give a quasi-complete solution of the (∆, N) problem for two well-known families of digraphs used as good models for large interconnection networks. In our study we also relate both families, the New Amsterdam and Manhattan digraphs, with the double-step graphs (or circulant graphs with degree two).
متن کاملInfinite Circulant Digraphs and Random Infinite Circulant Digraphs
In this paper, we completely determine the connectivity of every infinite circulant digraphs and prove that almost all infinite circulant digraphs are infinitely strongly connected and therefore have both oneand two-way infinite Hamiltonian paths.
متن کاملOn automorphism groups of circulant digraphs of square-free order
We show that the full automorphism group of a circulant digraph of square-free order is either the intersection of two 2-closed groups, each of which is the wreath product of 2-closed groups of smaller degree, or contains a transitive normal subgroup which is the direct product of two 2-closed groups of smaller degree. The work in this paper makes contributions to the solutions of two problems ...
متن کاملComputation of the q-th roots of circulant matrices
In this paper, we investigate the reduced form of circulant matrices and we show that the problem of computing the q-th roots of a nonsingular circulant matrix A can be reduced to that of computing the q-th roots of two half size matrices B - C and B + C.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 165-166 شماره
صفحات -
تاریخ انتشار 1997